Cyclic Redundancy Checking (CRC) Accelerator for Embedded Processor Datapaths
نویسندگان
چکیده
منابع مشابه
Cyclic Redundancy Checking (CRC) Accelerator for Embedded Processor Datapaths
We present the integration of a multimode Cyclic Redundancy Checking (CRC) accelerator unit with an embedded processor datapath to enhance the processor performance in terms of execution time and energy efficiency. We investigate the performance of CRC accelerated embedded processor datapath in terms of execution time and energy efficiency. Our evaluation shows that the CRC accelerated Microbla...
متن کاملArea and Energy Efficient Viterbi Accelerator for Embedded Processor Datapaths
Viterbi algorithm is widely used in communication systems to efficiently decode the convolutional codes. This algorithm is used in many applications including cellular and satellite communication systems. Moreover, Serializer-deserializers (SERDESs) having critical latency constraint also use viterbi algorithm for hardware implementation. We present the integration of a mixed hardware/software ...
متن کاملCyclic Redundancy Checking
A transmitted bit can be received in error, due to “noise” on the transmission channel. If we are dealing with voice or video data, the occurrence of errors in a small percentage of bits is quite tolerable, but in many other cases it is crucial that all bits be received intact. If for example we are downloading a binary program file, the program may be unexecutable if even one bit is incorrect....
متن کاملModel Checking for Dynamic Datapaths
We explore how to verify useful properties about networks that include “dynamic” elements, whose state and functionality may depend on previously observed traffic, e.g., caches, WAN optimizers, firewalls, and DPI boxes. We present the design and implementation of a tool that takes as input a network specification and verifies properties such as “traffic from host A will never reach host B direc...
متن کاملA two-step computation of cyclic redundancy code CRC-32 for ATM networks
In the field of telecommunications, among the numerous cyclic redundancy codes in use, ATM CRC-32 is difficult to compute because it is based on a polynomial of degree 32 that has many more terms (15) than any other CRC polynomial in common use. CRC checking and generation are generally carried out on a per-byte basis, in an attempt to cope with the dramatic increase of the data throughput of h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2017
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2017.080242